On the Erdos-Sos Conjecture for Graphs on n = k+3 Vertices
نویسنده
چکیده
Erdős and Sós conjectured in 1962 that if the average degree of a graph G exceeds k − 2, then G contains every tree on k vertices. In 1984, Zho proved the special case where G has k vertices. In 1996, Woźniak proved the cases where G has k + 2 vertices. We prove the conjecture for the case where G has k + 3 vertices.
منابع مشابه
On a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems
For n 2 k 2 3, let f(n,Ck) denote the maximum number rn for which it is possible to color the edges of the complete graph K" with rn colors in such a way that each k-cycle Ck in K" has a t least two edges of the same color. Erdos, Simonovits, and Sos conjectured that for every fixed k 2 3, k-2 1 f(n, Ck) = n (T +-) + O (1), k-1 and proved it only for k = 3. It is shown that f(n,C4) = n-t [Em]-1...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملAn extension of a result concerning convex geometric graphs
We show a general result known as the Erdos-Sos conjecture: if |E(G)| > 1 2 (k − 1)n where G has order n then G contains every tree of order k + 1 as a subgraph.
متن کاملA Disproof of a Conjecture of Erdos in Ramsey Theory
Denote by kt(G) the number of complete subgraphs of order f in the graph G. Let where G denotes the complement of G and \G\ the number of vertices. A well-known conjecture of Erdos, related to Ramsey's theorem, is that Mmn^K ct(ri) = 2 ~*. This latter number is the proportion of monochromatic Kt's in a random colouring of Kn. We present counterexamples to this conjecture and discuss properties ...
متن کاملOn Generalized Coprime Graphs
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 95 شماره
صفحات -
تاریخ انتشار 2010